Hierarchical Image Representation Simplification Driven by Region Complexity
نویسندگان
چکیده
This article presents a technique that arranges the elements of hierarchical representations of images according to a coarseness attribute. The choice of the attribute can be made according to prior knowledge about the content of the images and the intended application. The transformation is similar to filtering a hierarchy with a non-increasing attribute, and comprises the results of multiple simple filterings with an increasing attribute. The transformed hierarchy can be used for search space reduction prior to the image analysis process because it allows for direct access to the hierarchy elements at the same scale or a narrow range of scales.
منابع مشابه
Hierarchical image simplification and segmentation based on Mumford-Shah-salient level line selection
Hierarchies, such as the tree of shapes, are popular representations for image simplification and segmentation thanks to their multiscale structures. Selecting meaningful level lines (boundaries of shapes) yields to simplify image while preserving intact salient structures. Many image simplification and segmentation methods are driven by the optimization of an energy functional, for instance th...
متن کاملAn Innovative Multiple-Object Image Retrieval Framework Using Hierarchical Region Tree
Inaccurate image segmentation often has a negative impact on object-based image retrieval. Researchers have attempted to alleviate this problem by using hierarchical image representation. However, these attempts suffer from the inefficiency in building the hierarchical image representation and the high computational complexity in matching two hierarchically represented images. This paper presen...
متن کاملGenerating Various Levels of Detail of Architectural Objects for Image-Quality and Frame-Rate Control Rendering
This paper presents a method for representing complex models with various levels of detail. It is based on a geometrical simplification algorithm applied to a hierarchical scene described by a rooted-tree structure. In order to control the resulting image quality and the computation time, we use two algorithms which allow to choose an adequate representation of the scene according to user-speci...
متن کاملMorphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings
A method of text detection in natural images, to be turned into an effective embedded software on a mobile device, shall be both efficient and lightweight. We observed that a simple method based on the morphological Laplace operator can do the trick: we can construct in quasi-linear time a hierarchical image decomposition / simplification based on its 0-crossings, and search for some text in th...
متن کاملFast pseudo-semantic segmentation for joint region-based hierarchical and multiresolution representation
In this paper, we present a new scalable segmentation algorithm called JHMS (Joint Hierarchical and Multiresolution Segmentation) that is characterized by region-based hierarchy and resolution scalability. Most of the proposed algorithms either apply multiresolution segmentation or a hierarchical segmentation. The proposed approach combines both multiresolution and hierarchical segmentation pro...
متن کامل